Chromatic number and complete graph substructures for degree sequences

Given a graphic degree sequence D, let χ(D) (respectively ω(D), h(D), and H(D)) denote the maximum value of the chromatic number (respectively, the size of the largest clique, largest clique subdivision, and largest clique minor) taken over all simple graphs whose degree sequence is D. It is proved that χ(D) ≤ h(D). Moreover, it is shown that a subdivision of a clique of order χ(D) exists where each edge is subdivided at most once and the set of all subdivided edges forms a collection of disjoint stars. This bound is an analogue of the Hajós Conjecture for degree sequences and, in particular, settles a conjecture of Neil Robertson that degree sequences satisfy the bound χ(D) ≤ H(D) (which is related to the Hadwiger Conjecture). It is also proved that χ(D) ≤ 6 5 ω(D) + 3 5 and that χ(D) ≤ 4 5 ω(D) + 1 5 ∆(D) + 1, where ∆(D) denotes the maximum degree in D. The latter inequality is a strengthened version of a conjecture of Bruce Reed. All derived inequalities are best possible.